Boolean-Width of Graphs
نویسندگان
چکیده
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is the runtime bottleneck when using a divide-and-conquer approach. Boolean-width is similar to rank-width, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boolean-width. For an n-vertex graph G given with a decomposition tree of boolean-width k we show how to solve Minimum Dominating Set, Maximum Independent Set and Minimum or Maximum Independent Dominating Set in time O(n(n+ 2k)) . We show that for any graph the square root of its boolean-width is never more than its rank-width. We also exhibit a class of graphs, the Hsugrids, having the property that a Hsu-grid on Θ(n) vertices has boolean-width Θ(log n) and tree-width, branch-width, clique-width and rank-width Θ(n) . Moreover, any optimal rank-decomposition of such a graph will have boolean-width Θ(n) , i.e. exponential in the optimal boolean-width.
منابع مشابه
On graph classes with logarithmic boolean-width
Boolean-width is a recently introduced graph parameter. Many problems are fixed parameter tractable when parametrized by boolean-width, for instance "Minimum Weighted Dominating Set" (MWDS) problem can be solved in O∗(23k) time given a boolean-decomposition of width k, hence for all graph classes where a boolean-decomposition of width O(log n) can be found in polynomial time, MWDS can be solved...
متن کاملFinding Good Decompositions for Dynamic Programming on Dense Graphs
It is well-known that for graphs with high edge density the tree-width is always high while the clique-width can be low. Boolean-width is a new parameter that is never higher than tree-width or clique-width and can in fact be as small as logarithmic in clique-width. Boolean-width is defined using a decomposition tree by evaluating the number of neighborhoods across the resulting cuts of the gra...
متن کاملUpper Bounds on Boolean-Width with Applications to Exact Algorithms
Boolean-width is similar to clique-width, rank-width and NLC-width in that all these graph parameters are constantly bounded on the same classes of graphs. In many classes where these parameters are not constantly bounded, boolean-width is distinguished by its much lower value, such as in permutation graphs and interval graphs where boolean-width was shown to be O(logn) [1]. Together with FPT a...
متن کاملFast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width⋆
We consider the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rankwidth, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boolean-width. It compares well to the other four well-known width parameters tree-width, branch-width, clique-...
متن کاملGraph Classes with Structured Neighborhoods and Algorithmic Applications
Boolean-width is a recently introduced graph width parameter. If a boolean decomposition of width w is given, several NP-complete problems, such as Maximum Weight Independent Set, k-Coloring and Minimum Weight Dominating Set are solvable in O∗(2O(w)) time [5]. In this paper we study graph classes for which we can compute a decomposition of logarithmic boolean-width in polynomial time. Since 2 =...
متن کامل